Modified Approach for Solving Maximum Clique Problem

1.1 Maximum Clique Problem Assume that the finite undirected simple graph is given, where V is the set of nodes, E is the set of edges. The arbitrary full graph is called a clique. The clique, which does not contain other cliques, is called a maximal Clique. The largest maximal clique is called a maximum clique. To extract all maximal cliques from the graph G. Many algorithms have been described to solve this problem. The best solution now a days is a procedure where the complexity is linear to the number of maximal cliques [1,2]. The theory and algorithms described in this paper can solve the problem. We assume that the graph G is presented in the form of an